Ramified recurrence and computational complexity II: Substitution and poly-space
Identifieur interne : 00C716 ( Main/Exploration ); précédent : 00C715; suivant : 00C717Ramified recurrence and computational complexity II: Substitution and poly-space
Auteurs : Daniel Leivant [États-Unis] ; Jean-Yves Marion [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We prove an applicative characterization of poly-space as the set of functions over $$\mathbb{W} = \{ 0,1\} *$$ defined by ramified $$\mathbb{W}$$ -recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.
Url:
DOI: 10.1007/BFb0022277
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002E72
- to stream Istex, to step Curation: 002E34
- to stream Istex, to step Checkpoint: 002B31
- to stream Main, to step Merge: 00CF73
- to stream Main, to step Curation: 00C716
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Ramified recurrence and computational complexity II: Substitution and poly-space</title><author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C4D17B8F4220C449F48CE138C0F65F9839B0BA3C</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/BFb0022277</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E72</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E72</idno><idno type="wicri:Area/Istex/Curation">002E34</idno><idno type="wicri:Area/Istex/Checkpoint">002B31</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002B31</idno><idno type="wicri:doubleKey">0302-9743:1995:Leivant D:ramified:recurrence:and</idno><idno type="wicri:Area/Main/Merge">00CF73</idno><idno type="wicri:Area/Main/Curation">00C716</idno><idno type="wicri:Area/Main/Exploration">00C716</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Ramified recurrence and computational complexity II: Substitution and poly-space</title><author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Indiana University, 47405, Bloomington, IN</wicri:regionArea><placeName><region type="state">Indiana</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>CRIN - CNRS - INRIA Lorraine, Université Nancy I, 54506, Vandœuvre-lés-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We prove an applicative characterization of poly-space as the set of functions over $$\mathbb{W} = \{ 0,1\} *$$ defined by ramified $$\mathbb{W}$$ -recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.</div></front></TEI><affiliations><list><country><li>France</li><li>États-Unis</li></country><region><li>Grand Est</li><li>Indiana</li><li>Lorraine (région)</li></region><settlement><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><country name="États-Unis"><region name="Indiana"><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name></region><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name></country><country name="France"><region name="Grand Est"><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></region><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C716 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C716 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C4D17B8F4220C449F48CE138C0F65F9839B0BA3C
|texte= Ramified recurrence and computational complexity II: Substitution and poly-space
}}
| This area was generated with Dilib version V0.6.33. |  |